Fault-Tolerant Voting in a Simply-Typed Lambda Calculus

In this paper we present a translation from the simply typed lambda calculus into an extended simply typed lambda calculus that enables programs to be tolerant to transient faults. The translation triples all basic instructions and generates majority voting code for ensuring correct control-flow. We demonstrate that the generated voting code causes evaluation to proceed successfully even in the presence of a transient fault corrupting a register other than a control flow register (i.e., the stack pointer or the instruction pointer).